A Constrained Tectonics Model for Coronal Heating

An analytical and numerical treatment is given of a constrained version of the tectonics model developed by Priest, Heyvaerts, & Title [2002]. We begin with an initial uniform magnetic field ${\bf B} = B_0 \hat{\bf z}$ that is line-tied at the surfaces $z = 0$ and $z = L$. This initial configuration is twisted by photospheric footpoint motion that is assumed to depend on only one coordinate ($x$) transverse to the initial magnetic field. The geometric constraints imposed by our assumption precludes the occurrence of reconnection and secondary instabilities, but enables us to follow for long times the dissipation of energy due to the effects of resistivity and viscosity. In this limit, we demonstrate that when the coherence time of random photospheric footpoint motion is much smaller by several orders of magnitude compared with the resistive diffusion time, the heating due to Ohmic and viscous dissipation becomes independent of the resistivity of the plasma. Furthermore, we obtain scaling relations that suggest that even if reconnection and/or secondary instabilities were to limit the build-up of magnetic energy in such a model, the overall heating rate will still be independent of the resistivity

On the MIMO Channel Capacity of Multi-Dimensional Signal Sets

In this contribution we evaluate the capacity of Multi-Input Multi-Output (MIMO) systems using multi-dimensional PSK/QAM signal sets. It was shown that transmit diversity is capable of narrowing the gap between the capacity of the Rayleigh-fading channel and the AWGN channel. However, since this gap becomes narrower when the receiver diversity order is increased, for higher-order receiver diversity the performance advantage of transmit diversity diminishes. A MIMO system having full multiplexing gain has a higher achievable throughput than the corresponding MIMO system designed for full diversity gain, although this is attained at the cost of a higher complexity and a higher SNR. The tradeoffs between diversity gain, multiplexing gain, complexity and bandwidth are studied

On the MIMO Channel Capacity of Multi-Dimensional Signal Sets

In this contribution two general formulae were derived for the capacity evaluation of Multi-Input Multi-Output (MIMO) systems using multi-dimensional signal sets, different modulation schemes and an arbitrary number of transmit as well as receive antennas. It was shown that transmit diversity is capable of narrowing the gap between the capacity of the Rayleigh-fading channel and the AWGN channel. However, since this gap becomes narrower when the receiver diversity order is increased, for higher-order receiver diversity the performance advantage of transmit diversity diminishes. A MIMO system having full multiplexing gain has a higher achievable capacity, than the corresponding MIMO system designed for achieving full diversity gain, provided that the channel SNR is sufficiently high

Experiments on the dynamic behavior of cavitating pumps

This paper describes experiments performed to measure the dynamic transfer matrices for cavitating (and noncavitating) pumps. These transfer matrices describe the relationship between small linear oscillatory perturbations in the pressures and mass flow rates at inlet and discharge from the hydraulic machine. The matrices were deduced from direct measurements of these fluctuating quantities for different modes of excitation of the machine. Results for a cavitating inducer are presented as functions of frequency and mean operating state. Though some of the trends in the data are consistent with existing theoretical models of inducer dynamics, others are not, indicating a need for further theoretical investigation of the dynamic characteristics of such flows. The results exhibit increasingly complex dynamics with increasing cavitation; it appears that the hydraulic machine deviates from an essentially passive response without cavitation to an increasingly active response as the cavitation number is reduced

Lower bounds for the stable marriage problem and its variants

In an instance of the stable marriage problem of size n, n men and n women each ranks members of the opposite sex in order of preference. A stable marriage is a complete matching M = {(m_1, w_i_1), (m_2, w_i_2), ..., (m_n, w_i_n)} such that no unmatched man and woman prefer each other to their partners in M.A pair (m_i, w_j) is stable if it is contained in some stable marriage. In this paper, we prove that determining if an arbitrary pair is stable requires Ω(n^2) time in the worst case. We show, by an adversary argument, that there exists instances of the stable marriage problem such that it is possible to find at least one pair that exhibits the Ω(n^2) lower bound.As corollaries of our results, the lower bound of Ω(n^2) is established for several stable marriage related problems. Knuth, in his treatise on stable marriage, asks if there is an algorithm that finds a stable marriage in less than Θ(n^2) time. Our results show that such an algorithm does not exist

Complexity of the stable marriage and stable roommate problems in three dimensions

The stable marriage problem is a matching problem that pairs members of two sets. The objective is to achieve a matching that satisfies all participants based on their preferences. The stable roommate problem is a variant involving only one set, which is partitioned into pairs with a similar objective. There exist asymptotically optimal algorithms that solve both problems.In this paper, we investigate the complexity of three dimensional extensions of these problems. This is one of twelve research directions suggested by Knuth in his book on the stable marriage problem. We show that these problems are NP-complete, and hence it is unlikely that there exist efficient algorithms for their solutions.Applying the polynomial tranformation developed in this paper, we extend the NP-completeness result to include the problem of matching couples - who are both medical school graduates - to pairs of hospital resident positions. This problem is important in practice and is dealth with annually by NRMP, the centralized program that matches all medical school graduates in the United States to available resident positions